Coherent adequate sets and forcing square
نویسندگان
چکیده
منابع مشابه
Forcing with adequate sets of models as side conditions
We present a general framework for forcing on ω2 with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial segment. We give several examples of this type of forcing, including adding a function on ω2, adding a nonreflecting stationary subset of ω2 ∩ cof(ω), and adding an ω...
متن کاملRadius-forcing sets in graphs
Let G be a connected graph of order p and let 0 ::f. s ~ V ( G). Then S is a rad(G)-forcing set (or a radius-forcing set of G) if, for each v E V(G), there exists v' E S with dc(v, v') ?: rad(G). The cardinality of a smallest radius-forcing set of G is called the radius-forcing number of G and is denoted by rf(G). A graph G is called a randomly k-forcing graph for a positive integer k if every ...
متن کاملRudimentary recursion, provident sets and forcing
and call a set A provident if it is transitive and closed under all p-rud-rec functions with p a member of A. * If ζ is the least ordinal not in a provident set A, then ζ is indecomposable, that is, that the sum of two ordinals less than ζ is less than ζ. Conversely, if ζ is indecomposable, η > ζ and p ∈ Jζ , then the Jensen set Jη is is closed under all p-rud rec functions; in particular Jζ is...
متن کاملRigid origami vertices: conditions and forcing sets
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, wh...
متن کاملProvident sets and rudimentary set forcing
Using the theory of rudimentary recursion and provident sets developed in a previous paper, we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s Jω. Much of the development is rudimentary or at worst given by rudimentary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2014
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm224-3-5